Scale Filtered Euclidean Medial Axis
نویسندگان
چکیده
We propose an Euclidean medial axis filtering method which generates subsets of Euclidean medial axis were filtering rate is controlled by one parameter. The method is inspired by Miklos’, Giesen’s and Pauly’s scale axis method which preserves important features of an input object from shape understanding point of view even if they are at different scales. Our method overcomes the most important drawback of scale axis: scale axis is not, in general, a subset of Euclidean medial axis. It is even not necessarily a subset of the original shape. The method and its properties are presented in 2D space but it can be easily extended to any dimension. Experimental verification and comparison with a few previously introduced methods are also included.
منابع مشابه
Scale filtered Euclidean medial axis and its hierarchy
We propose an Euclidean medial axis filtering method which generates subsets of the Euclidean medial axis, where filtering rate is controlled by one parameter. The method is inspired by Miklos’, Giesen’s and Pauly’s scale axis method which preserves important features of an input object from shape understanding point of view even if they are at different scales. Our method overcomes the most im...
متن کاملEuclidean and Geodesic Distance Profiles
This paper presents a boundary-based, topological shape descriptor: the distance profile. It is inspired by the LBP (= local binary pattern) scale space – a topological shape descriptor computed by a filtration with concentric circles around a reference point. For rigid objects, the distance profile is computed by the Euclidean distance of each boundary pixel to a reference point. A geodesic di...
متن کاملFinding a minimum medial axis of a discrete shape is NP-hard
The medial axis is a classical representation of digital objects widely used in many applications. However, such a set of balls may not be optimal: subsets of the medial axis may exist without changing the reversivility of the input shape representation. In this article, we first prove that finding a minimum medial axis is an NP-hard problem for the Euclidean distance. Then, we compare two algo...
متن کاملVisible Vectors and Discrete Euclidean Medial Axis
We denote by M R the test neighbourhood sufficient to extract the Euclidean Medial Axis of any n-dimensional discrete shape whose inner radius is no greater than R. In this paper, we study properties of discrete Euclidean disks overlappings so as to prove that in any given dimension n, M R tends to the set of visible vectors as R tends to infinity.
متن کاملEuclidean Skeletons of 3D Data Sets in Linear Time by the Integer Medial Axis Transform
A general algorithm for computing Euclidean skeletons of 3D data sets in linear time is presented. These skeletons are defined in terms of a new concept, called the integer medial axis (IMA) transform. The algorithm is based upon the computation of 3D feature transforms, using a modification of an algorithm for Euclidean distance transforms. The skeletonization algorithm has a time complexity w...
متن کامل